Target Set Selection Problem for Honeycomb Networks
نویسندگان
چکیده
منابع مشابه
Target set selection problem for honeycomb networks
Let G be a graph with a threshold function θ : V (G) → N such that 1 ≤ θ(v) ≤ dG(v) for every vertex v of G, where dG(v) is the degree of v in G. Suppose we are given a target set S ⊆ V (G). The paper considers the following repetitive process on G. At time step 0 the vertices of S are colored black and the other vertices are colored white. After that, at each time step t > 0, the colors of whi...
متن کاملWeighted Target Set Selection on Social Networks
Viral marketing and influence maximization on social networks has become a problem of significant interest. We consider a problem in this setting referred to as the weighted target set selection (WTSS) problem. Earlier research focused on approximation algorithms for the unweighted case of the problem which is known to be NP-hard. Motivated by the desire to develop a better understanding of fun...
متن کاملSome Results on the Target Set Selection Problem
In this paper we consider a fundamental problem in the area of viral marketing, called TARGET SET SELECTION problem. We study the problem when the underlying graph is a block-cactus graph, a chordal graph or a Hamming graph. We show that if G is a block-cactus graph, then the TARGET SET SELECTION problem can be solved in linear time, which generalizes Chen’s result [2] for trees, and the time c...
متن کاملLatency-Bounded Target Set Selection in Social Networks
Motivated by applications in sociology, economy and medicine, we study variants of the Target Set Selection problem, first proposed by Kempe, Kleinberg and Tardos. In our scenario one is given a graph G = (V,E), integer values t(v) for each vertex v (thresholds), and the objective is to determine a small set of vertices (target set) that activates a given number (or a given subset) of vertices ...
متن کاملSingle Assignment Capacitated Hierarchical Hub Set Covering Problem for Service Delivery Systems Over Multilevel Networks
The present study introduced a novel hierarchical hub set covering problem with capacity constraints. This study showed the significance of fixed charge costs for locating facilities, assigning hub links and designing a productivity network. The proposed model employs mixed integer programming to locate facilities and establish links between nodes according to the travel time between an origin-...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: SIAM Journal on Discrete Mathematics
سال: 2013
ISSN: 0895-4801,1095-7146
DOI: 10.1137/120868864